Simplification and Backjumping in Modal Tableau
نویسندگان
چکیده
This paper is concerned with various schemes for enhancing the performance of modal tableau procedures. It discusses techniques and strategies for dealing with the nondeterminism in tableau calculi, as well as simplification and backjumping. Benchmark results obtained with randomly generated modal formulae show the effect of combinations of different schemes.
منابع مشابه
System Description: The Tableaux Work Bench
The Tableaux Work Bench (TWB) is a meta tableau system designed for logicians with limited programming or automatic reasoning knowledge to experiment with new tableau calculi and new decision procedures. It has a simple interface, a history mechanism for controlling loops or pruning the search space, and modal simplification.
متن کاملTowards the use of Simplification Rules in Intuitionistic Tableaux
By replacement it is meant the substitution of one or more occurrences of a formula with an equivalent one. In automated deduction this can be useful to reduce the search space. In tableau calculi for classical and modal logics this technique is known as simplification and consists in replacing a formula with a logical constant (> or ⊥). Recently, this idea has been applied to Intuitionistic Lo...
متن کاملRestart-repair and Learning: An empirical study of single solution 3-SAT problems
The aim of this paper is to demonstrate that a particular non-systematic search algorithm based on restart-repair and learning no-goods can solve single solution 3-SAT problems efficiently. These problems are thought to present a severe challenge for algorithms of this sort since the burden of handling nogoods will rapidly become insupportable. We show that this is not the case here. The result...
متن کاملExtended Caching and Backjumping for Expressive Description Logics
Due to the wide range of modelling constructs supported by the expressive DLSROIQ, the typically used tableau algorithms in competitive reasoning systems such as FaCT++ [16], HermiT,3 or Pellet [14] have a very high worst-case complexity. The development of tableau optimisations that help to achieve practical efficiency is, therefore, a longstanding challenge in DL research (see, e.g., [11, 17]...
متن کاملHam-alc
HAM-ALC: The tests were performed using HAM-ALC version 1.1. HAM-ALC [2] is a description logic classifier which has been constructed for providing a basis for an optimized ALCRP(D) [1] implementation. Based on a sound and complete tableau algorithm HAM-ALC currently implements a true ABox reasoner for the logic ALC. HAM-ALC employs a few optimizations inspired by FaCT [3], in particular semant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998